Profiles of Permutations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Profiles of Permutations

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set S with asymptotic density σ and, on the other hand, permutations selected according to the Ewens distribution with parameter σ. In particular we show that the asymptotic expected number of cycles of random permutations of [n] with all cycles...

متن کامل

Sharply $(n-2)$-transitive Sets of Permutations

Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...

متن کامل

Intersecting families of permutations and partial permutations

The above result motivated the study of intersecting families of permutations which was initiated by Deza and Frankl, see [2]. Let Sn be the symmetric group on [n], that is the group of all permutations of [n]. For a positive integer t, a subset A of Sn is said to be t-intersecting if, for any g, h ∈ A with g 6= h, we have |{x : g(x) = h(x)}| ≥ t. By an intersecting family, we mean an 1-interse...

متن کامل

Using Interviews to Explore Teacher Knowledge Profiles in the Area of Permutations

This paper illustrates consideration of multiple facets of mathematics teacher knowledge through interviews, demonstrates how teachers have different knowledge profiles, and discusses the implications for professional development. This study focuses on interviews with eight teachers, which were analyzed using Ball, Thames, and Phelps’ (2008) framework of teacher knowledge, assigning knowledge t...

متن کامل

A Stream Cipher Based on Chaotic Permutations

In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2009

ISSN: 1077-8926

DOI: 10.37236/188